Partial Realization in Generalized Bases: Algorithm and Example

نویسنده

  • Thomas J. de Hoog
چکیده

A solution is presented for the problem of realizing a minimal state-space model of an LTI discrete-time system from a partial expansion in terms of generalized orthonormal basis functions, also known as Hambo basis functions. For the solution of the minimal partial realization problem fruitful use is made of the Hambo operator transform theory that underlies the basis function expansion. The resulting realization algorithm can be applied in an approximative sense, for instance for the computation of a low order model from a large basis function expansion that is obtained in an identification experiment. This approach is illustrated with an example.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the fixed point theorems in generalized weakly contractive mappings on partial metric spaces

In this paper, we prove a fixed point theorem for a pair of generalized weakly contractive mappings in complete partial metric spaces. The theorems presented are generalizations of very recent fixed point theorems due to Abdeljawad, Karapinar and Tas. To emphasize the very general nature of these results, we illustrate an example.

متن کامل

An Algorithm for Multi-Realization of Nonlinear MIMO Systems

This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...

متن کامل

Reproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation

In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.

متن کامل

A Generalized Criterion for Signature-based Algorithms to Compute Gröbner Bases

A generalized criterion for signature-based algorithms to compute Gröbner bases is proposed in this paper. This criterion is named by “generalized criterion”, because it can be specialized to almost all existing criteria for signature-based algorithms which include the famous F5 algorithm, F5C, extended F5, GV and the GVW algorithm. The main purpose of current paper is to study in theory which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000